Distinguishability transitions in nonunitary boson-sampling dynamics

نویسندگان

چکیده

We discover novel transitions characterized by distinguishability of bosons in non-unitary dynamics with parity-time ($\mathcal{PT}$) symmetry. show that $\mathcal{PT}$ symmetry breaking, a unique transition non-Hermitian open systems, enhances regions which can be regarded as distinguishable. This means classical computers sample the boson distributions efficiently these sampling distribution distinguishable particles. In $\mathcal{PT}$-symmetric phase, we find one dynamical upon deviates from particles, when are initially put at distant sites. If system enters $\mathcal{PT}$-broken threshold time for is suddenly prolonged, since each diffusive (ballistic) ($\mathcal{PT}$-symmetric) phase. Furthermore, phase also exhibits notable on longer scale, again become transition, and hence easiness long times, true generic postselected quantum dynamics, while it absent unitary isolated systems. breaking efficiency algorithm based rank matrices, (cannot) compute photon long-time regime

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Driven Boson Sampling.

Sampling the distribution of bosons that have undergone a random unitary evolution is strongly believed to be a computationally hard problem. Key to outperforming classical simulations of this task is to increase both the number of input photons and the size of the network. We propose driven boson sampling, in which photons are input within the network itself, as a means to approach this goal. ...

متن کامل

Experimental scattershot boson sampling

Boson sampling is a computational task strongly believed to be hard for classical computers, but efficiently solvable by orchestrated bosonic interference in a specialized quantum computer. Current experimental schemes, however, are still insufficient for a convincing demonstration of the advantage of quantum over classical computation. A new variation of this task, scattershot boson sampling, ...

متن کامل

Microwave boson sampling

The first post-classical computation will most probably be performed not on a universal quantum computer, but rather on a dedicated quantum hardware. A strong candidate for achieving this is represented by the task of sampling from the output distribution of linear quantum optical networks. This problem, known as boson sampling, has recently been shown to be intractable for any classical comput...

متن کامل

Photonic boson sampling in a tunable circuit.

Quantum computers are unnecessary for exponentially efficient computation or simulation if the Extended Church-Turing thesis is correct. The thesis would be strongly contradicted by physical devices that efficiently perform tasks believed to be intractable for classical computers. Such a task is boson sampling: sampling the output distributions of n bosons scattered by some passive, linear unit...

متن کامل

The Multiphoton Boson Sampling Machine Doesn't Beat Early Classical Computers for Five-boson Sampling

An ignored algorithm called Store-reuse for calculating the permanent of an n  n matrix is considered. It utilizes computer storages sufficiently, and uses stored data repetitively. The analysis manifests that the numbers of multiplications and additions taken by the Store-reuse algorithm are respectively far smaller than those taken by the famous Ryser's algorithm. As to the 5-boson sampling,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical review research

سال: 2023

ISSN: ['2643-1564']

DOI: https://doi.org/10.1103/physrevresearch.5.013177